Competitive regularised regression

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive optimization of hyperparameters in L2-regularised logistic regression

We investigate a gradient-based method for adaptive optimization of hyperparameters in logistic regression models. Adaptive optimization of hyperparameters reduces the computational cost of selecting good hyperparameter values, and allows these optimal values to be pinpointed more precisely, as compared to an exhaustive search of the hyperparameter space.

متن کامل

Competitive On-line Linear Regression

We apply a general algorithm for merging prediction strategies (the Aggregating Algorithm) to the problem of linear regression with the square loss; our main assumption is that the response variable is bounded. It turns out that for this particular problem the Aggregating Algorithm resembles, but is slightly different from, the wellknown ridge estimation procedure. From general results about th...

متن کامل

Regularised Range Flow

Extending a differential total least squares method for range flow estimation we present an iterative regularisation approach to compute dense range flow fields. We demonstrate how this algorithm can be used to detect motion discontinuities. This can can be used to segment the data into independently moving regions. The different types of aperture problem encountered are discussed. Our regulari...

متن کامل

Wavelet Regularised Maximum Entropy

Reconstructing maps of fluctuations in the Cosmic Microwave Background (CMB) radiation from observed data requires a number of steps in the data analysis. Among these are the removal of receiver noise, the deconvolution of the image and the separation and subtraction of foreground contaminants. The latter is usually achieved by the use of multifrequency observations, which exploit the different...

متن کامل

Graph Regularised Hashing

Hashing has witnessed an increase in popularity over the past few years due to the promise of compact encoding and fast query time. In order to be effective hashing methods must maximally preserve the similarity between the data points in the underlying binary representation. The current best performing hashing techniques have utilised supervision. In this paper we propose a two-step iterative ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2020

ISSN: 0925-2312

DOI: 10.1016/j.neucom.2019.08.094